Discrete lot sizing and scheduling using product decomposition into attributes
نویسندگان
چکیده
منابع مشابه
Discrete lot sizing and scheduling using product decomposition into attributes
A production planning problem, known as the Discrete Lot sizing and S cheduling P roblem with seq uence-dependent changeov er costs, is considered. W e propose a new way of modelling the production sy stem based on the use of a multi attribute product structure encountered in many industrial situations. T he basic idea is to describe the products as combinations of phy sical attributes and to e...
متن کاملTabu Search for a Discrete Lot Sizing and Scheduling Problem
In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...
متن کاملOn discrete lot-sizing and scheduling on identical parallel machines
We consider the multi-item discrete lot-sizing and scheduling problem on identical parallel machines. Based on the fact that the machines are identical, we introduce aggregate integer variables instead of individual variables for each machine. For the problem with start-up costs, we show that the inequalities based on a unit flow formulation for each machine can be replaced by a single integer ...
متن کاملMulti-product lot-sizing and scheduling on unrelated parallel machines
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملMulti-product valid inequalities for the discrete lot-sizing and scheduling problem
We consider a problem arising in the context of industrial production planning, namely the multi-product discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. We aim at developing an exact solution approach based on a Cut & Branch procedure for this combinatorial optimization problem. To achieve this, we propose a new family of multi-product valid inequalities whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2009
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.11.017